A estrada: canibalismo e experiência moral

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estrada and L-Estrada Indices of Edge-Independent Random Graphs

Let G be a simple graph of order n with eigenvalues λ1, λ2, · · · , λn and normalized Laplacian eigenvalues μ1,μ2, · · · ,μn. The Estrada index and normalized Laplacian Estrada index are defined as EE(G) = ∑n k=1 e λk and LEE(G) = ∑n k=1 e μk−1, respectively. We establish upper and lower bounds to EE and LEE for edge-independent random graphs, containing the classical Erdös-Rényi graphs as spec...

متن کامل

Laplacian Estrada and Normalized Laplacian Estrada Indices of Evolving Graphs

Large-scale time-evolving networks have been generated by many natural and technological applications, posing challenges for computation and modeling. Thus, it is of theoretical and practical significance to probe mathematical tools tailored for evolving networks. In this paper, on top of the dynamic Estrada index, we study the dynamic Laplacian Estrada index and the dynamic normalized Laplacia...

متن کامل

Lower Bounds for Estrada Index

If G is an (n,m)-graph whose spectrum consists of the numbers λ1, λ2, . . . , λn, then its Estrada index is EE(G) = ∑n i=1 e λi . We establish lower bounds for EE(G) in terms of n and m. Introduction In this paper we are concerned with simple graphs, that have no loops and no multiple or directed edges. Let G be such a graph, and let n and m be the number of its vertices and edges. Then we say ...

متن کامل

Estrada Index of Benzenoid Hydrocarbons

A structure-descriptor EE, recently proposed by Estrada, is examined. If λ1, λ2, . . . ,λn are the eigenvalues of the molecular graph, then EE = n ∑ i=1 eλi . In the case of benzenoid hydrocarbons with n carbon atoms and m carbon-carbon bonds, EE is found to be accurately approximated by means of the formula a1 n cosh (√ 2m/n ) +a2, where a1 ≈ 1.098 and a2 =−0.64 are empirically determined fitt...

متن کامل

Bounds of distance Estrada index of graphs

Let λ1, λ2, · · · , λn be the eigenvalues of the distance matrix of a connected graph G. The distance Estrada index of G is defined as DEE(G) = ∑ n i=1 ei . In this note, we present new lower and upper bounds for DEE(G). In addition, a Nordhaus-Gaddum type inequality for DEE(G) is given. MSC 2010: 05C12, 15A42.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Literatura e Autoritarismo

سال: 2019

ISSN: 1679-849X,1679-849X

DOI: 10.5902/1679849x39350